Second Derivative Multistep Method with Nested Hybrid Evaluation
نویسندگان
چکیده
منابع مشابه
Polynomial Formulation of Second Derivative Multistep Methods
Following the work of Enright [3] there has been interest in studying second derivative methods for solving stiff ordinary differential equations. Successful implementations of second derivative methods have been reported by Enright [3], Sacks-Davis [9], [10] and Addison[l]. Wallace and Gupta [13] have suggested a polynomial formulation of the usual first-derivative multistep methods. Recently ...
متن کاملA Second Derivative Sqp Method with Imposed
Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particular, the resulting quadratic programming (QP) subproblems are often nonconvex, and thus finding th...
متن کاملA Second Derivative SQP Method: Global Convergence
Gould and Robinson (NAR 08/18, Oxford University Computing Laboratory, 2008) gave global convergence results for a second-derivative SQP method for minimizing the exact l1-merit function for a fixed value of the penalty parameter. To establish this result, we used the properties of the so-called Cauchy step, which was itself computed from the so-called predictor step. In addition, we allowed fo...
متن کاملA Second Derivative Sqp Method : Local Convergence
In [19], we gave global convergence results for a second-derivative SQP method for minimizing the exact l1-merit function for a fixed value of the penalty parameter. To establish this result, we used the properties of the so-called Cauchy step, which was itself computed from the so-called predictor step. In addition, we allowed for the computation of a variety of (optional) SQP steps that were ...
متن کاملA Second Derivative Sqp Method : Theoretical Issues
Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particular, the resulting quadratic programming (QP) subproblems are often nonconvex, and thus finding th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian Research Journal of Mathematics
سال: 2018
ISSN: 2456-477X
DOI: 10.9734/arjom/2018/41601